Innovations in Computer Science 2010 Are Stable Instances Easy ? ∗
نویسندگان
چکیده
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP–hard problems are easier to solve. In particular, whether there exist algorithms that solve correctly and in polynomial time all sufficiently stable instances of some NP–hard problem. The paper focuses on the Max–Cut problem, for which we show that this is indeed the case.
منابع مشابه
A Margin-based Model with a Fast Local Searchnewline for Rule Weighting and Reduction in Fuzzynewline Rule-based Classification Systems
Fuzzy Rule-Based Classification Systems (FRBCS) are highly investigated by researchers due to their noise-stability and interpretability. Unfortunately, generating a rule-base which is sufficiently both accurate and interpretable, is a hard process. Rule weighting is one of the approaches to improve the accuracy of a pre-generated rule-base without modifying the original rules. Most of the pro...
متن کاملA hardware-independent virtual architecture for PASCAL* by VISW
Since its introduction in 1971, PASCAL language has received rapid acceptance as a structured programming tool in a wide variety of applications ranging from computer science education to systems programming in production environments. It is, therefore, not surprising that numerous reports relating to implementation of PASCAL compilers on various computers continue to appear in the current lite...
متن کاملA New Framework for Secure Routing in VANET
Vehicular Ad-Hoc Networks can enhance road safety and enable drivers to avoid different threats. Safety applications, mobile commerce, and other information services are among different available services that are affected by dynamic topology, vehicle’s speed and node misbehaving. Dynamic topology makes the route unstable and unreliable. So, improving the throughput and performance of VANET thr...
متن کاملWhy Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization version of the Closest String problem, and give a 2-approximation algorithm, which we refer to as CSP-Greedy, that runs in O(n` + `)-time, where ` is the string length and n is the number of strings. Using smoothed analysis...
متن کاملHigh performance of the support vector machine in classifying hyperspectral data using a limited dataset
To prospect mineral deposits at regional scale, recognition and classification of hydrothermal alteration zones using remote sensing data is a popular strategy. Due to the large number of spectral bands, classification of the hyperspectral data may be negatively affected by the Hughes phenomenon. A practical way to handle the Hughes problem is preparing a lot of training samples until the size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009